منابع مشابه
The compactness of adaptive routing tables
The compactness of a routing table is a complexity measure of the memory space needed to store the routing table on a network whose nodes have been labeled by integers. It is defined as the smallest integer k such that, in every node u, every set of labels of destinations having the same output in the table of u can be represented as the union of k intervals of consecutive labels. If lot of wor...
متن کاملa study on construction of iranian life tables: the case study of modified brass logit system
چکیده ندارد.
15 صفحه اولGroup Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of processes is constructed in the network, ensuring each group member is included in the tree. To build this tree, the group routing protocol relies upon the unicast routing tables of each process. Thus, group routing is a com...
متن کاملOn the Resilience of Routing Tables
Many modern network designs incorporate “failover” paths into routers’ forwarding tables. In this paper, we formally address the conditions under which such resilient routing tables can guarantee delivery of packets.
متن کاملThe Compactness of Interval Routing for Almost All Graphs
Interval routing is a compact way of representing routing tables on a graph. It is based on grouping together, in each node, destination addresses that use the same outgoing edge in the routing table. Such groups of addresses are represented by some intervals of consecutive integers. We show that almost all the graphs, i.e., a fraction of at least 1 − 1/n2 of all the n-node graphs, support a sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2003
ISSN: 1570-8667
DOI: 10.1016/s1570-8667(03)00027-3